System and method for generating a fixed point approximation to nonlinear functions

ABSTRACT

A system and method are provided for use in an electronic device configured to process data to perform a method of generating a fixed point approximation of a number x by first locating the most significant bit of a given number, then retrieving predetermined values from electronic data storage, where the first value is based on a first index value generated from the most significant bit and contains fixed-point representation located in a table in storage. Then, output values are generated from look-up tables that correspond to index values generated from a number of bits that immediately following the most significant bit. Finally, the final mathematic result is computed using fixed-point arithmetic logic to generate a fixed point approximation.

This is a continuation of U.S. Ser. No. 11/207,024, filed Aug. 17, 2005 now U.S. Pat. No. 7,657,589, which is incorporated by reference.

BACKGROUND

The invention relates to using electronic devices such as computers to solve a class of nonlinear functions, specifically power functions, such as x^(1/3), x^(0.76312), x^(−1/2) and similar functions. More specifically, the invention addresses the case where both the input and output are fixed-point numbers represented in binary format, such as is used in computers and other electronic devices.

Electronic devices such as computers require complex mathematical computations to be performed in order to operate. For example, in a video signal processor, color, contrast and other characteristics that need to be projected or otherwise presented in visual media are quantified in numerical values. Mathematical operations are then performed on these values to enable a device such as a television to operate. These operations need to be finite by their nature so that the device can operate, thus they must be approximated. The performance of a device depends on its ability to efficiently approximate results to data processing equations. One such operation is the approximation of a fixed point number raised to a power. There are a number of conventional techniques that address the problem of generating a fixed point approximation to power functions using electronic hardware and software, particularly in video or audio applications, where voluminous amounts of data needs to constantly and accurately be processes. Even more particularly, high definition media processors require an enormous amount of data processing to enable quality media presentations. Some methods of approximating a power functions include Taylor series approximation, Newton-Raphson method or table lookup. Each of these methods has tradeoffs between complexity in terms of memory or operations, restrictions on the domain and or range of the function to be approximated, and accuracy of the result. For example, a Taylor series is appropriate only if the expansion is around a convenient number and all input values, known in the art as the domain, are close to that number. Otherwise the accuracy suffers. Newton-Raphson is limited because of the processing power required to produce a result. For example, the Newton-Raphson method may operate adequately in some applications for finding the square root of a number, but would not work well for generating the results for the 4/3 or 3/4 powers because of complexity in terms of operations. The memory required for a table lookup is proportional to the domain of the function. Thus, if an application needs a great deal of data, such as audio or video data, a great deal of storage space would be needed to store such tables, and the database operations would further slow down the processing.

The problem with conventional techniques is that there is a good deal of complexity, which translates into a need for a large amount of memory space and a large number of operations to be performed. Limiting these factors correlates to a limit in the domain of possible variables and results. Conventional methods also provide only limited accuracy when approximating power functions using fixed-point arithmetic. Most systems and methods simply use a complex set of lookup tables, or rely on Taylor series approximations that require a relatively large number of mathematical calculations, such as adds and multiplies.

Therefore, there exists a need many fields for an accurate system and method for generating a fixed point approximation that is not burdensome on a processor or on memory of a given device. As will be seen the invention accomplishes this in an elegant manner.

DETAILED DESCRIPTION

The invention is directed to a system and method for performing power functions that allows for a large domain and provides reasonable accuracy for approximating power functions using fixed-point arithmetic. The invention provides a novel combination of a table lookup combined with Taylor series approximation that uses relatively small tables and a handful of adds and multiplies.

The invention improves performance of electronic devices that require the computation of nonlinear functions by greatly streamlining necessary calculations. Examples include portable music devices that use CODECs that require nonlinear quantization in both the recording and playback of audio, 3-D graphic devices which rely heavily on the inversion (i.e., x^(−1)) data for rendering, and other applications where expedient computations improve performance.

More particularly, the invention is directed to a system and method of generating a fixed point approximation for a powers function. First, the novel method is configured to determine a value, denoted N, of the most significant bit in x to serve as an index into a table that contains fixed-point representations of x^((N−fractional) ^(—) ^(bits)y). The retrieved value is denoted as v₁, and storing the value. Then, an index is generated, denoted M, from a predetermined number of bits following the most significant bit, such as the k_(o) bits immediately following the most significant bit. M is used as an index to address a second table that contains two output values per table entry. In the tables, values are pre-calculated to save memory space and processing time, including the following values: v ₂=(1+a ₁2⁻¹ +a ₂2⁻² + . . . +a _(k) _(o) 2^(−k) ^(o) )^(y); and v ₃ =y/(1+a ₁2⁻¹ + . . . +a _(k) _(o) 2^(−k) ^(o) ). These values are then stored for later incorporation into the final formula. Then the process calls for creating a fixed-point number from remaining bits of x, if any exist, that directly follow the index M bits. These remaining bits are then inserted into the created number starting at the k_(o)+1 fractional-bit to get a result. Here, both the integer-bits and the first k_(o) fractional-bits of the result are all zero, and wherein the remaining bits of the result are the remaining bits of x to generate a second result, v₄. The second result is then stored. The final result is then computed from the formula x^(y)≈v₁×v₂×[1+(v₃×v₄)] using fixed-point arithmetic to generate a fixed point approximation.

Below is a mathematical expression of an embodiment of the invention. The value “x” is a fixed-point number, which may be expressed in binary as:

$\begin{matrix} {x = {2^{N} + {a_{1}2^{N - 1}} + {a_{2}2^{N - 2}} + \ldots + {a_{k}2^{N - k}}}} \\ {= {2^{N}\left( {1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k}2^{- k}}} \right)}} \end{matrix}$ In the case of the general power function x^(y):

$\begin{matrix} \begin{matrix} {x_{y} = \left\lbrack {2^{N}\left( {1 + {a_{1}2^{- 1}} + \ldots + {a_{k_{o}}2^{- k_{o}}} + {a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + \ldots + {a_{k}2^{- k}}} \right)} \right\rbrack^{y}} \\ {= \left\lbrack {2^{N}\left( {1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)\left( {1 + \frac{{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{o} + 2})}}} + \ldots + {a_{k}2^{- k}}}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}}} \right)} \right\rbrack^{y}} \\ {= {\left( 2^{N} \right)^{y}\left( {1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)^{y}\left( {1 + \frac{{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{o} + 2})}}} + \ldots + {a_{k}2^{- k}}}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}}} \right)^{y}}} \end{matrix} & (1) \end{matrix}$ The first two bracketed terms here have the following properties. The value N in the first term is the position of the most significant bit. The first term is therefore found via table lookup according to value of N. The number of entries in the table corresponds to the number of bits the input has (e.g., if the input is 20 bits, the table has 20 entries). While N provides the index into the table, the table entries are pre-computed values of (2^(N))^(y). The bit-width of each table entry depends on the desired accuracy. The second term is simply a lookup into a k_(o)-bit table (2^(k) ^(o) entries). An index is formed directly from the k_(o) coefficients and the (1+a₁2⁻¹+a₂2⁻²+ . . . +a_(k) _(o) 2^(−k) ^(o) )^(y) values are stored in the table.

According to the invention, the third term in Equation (1) is forced into a form amenable to Taylor series expansion. Those skilled in the art understand that a Taylor series works well only in a finite interval around a defined point, such as x^(y) for example, where 0.9≦x<1.1. The general case of x^(y) does not meet this criteria. However, it has been discovered that the third term in Equation (1),

$\left( {1 + \frac{{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{o} + 2})}}} + \ldots + {a_{k}2^{- k}}}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {{a_{k}}_{o}2^{- k_{o}}}}} \right)$ is guaranteed to be close to 1. It has been further observed that this makes the entire third term ideal for a Taylor series expansion. Consider the first order Taylor series expansion about the value 1: f(z)≈f(1)+f′(1)(z−1) In terms of what the third term in (1) is, where z is close to 1:

$\begin{matrix} {(z)^{y} = \left( {1 + \frac{{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{a} + 2})}}} + \ldots + {a_{k}2^{- k}}}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}}} \right)^{y}} \\ {\cong {1 + {y\left( \frac{{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{o} + 2})}}} + \ldots + {a_{k}2^{- k}}}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)}}} \\ {{= {1 + \left( \frac{y}{1 + {a_{1}2^{- 1}} + {a_{2}2^{- 2}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)}}\mspace{25mu}\left( {{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + {a_{k_{o} + 2}2^{- {({k_{o} + 2})}}} + \ldots + {a_{k}2^{- k}}} \right)} \end{matrix}$ Plugging this back into Equation (1) gives Equation (2) as follows:

$x^{y} = {\left( 2^{N} \right)^{y}\left( {1 + {a_{1}2^{- 1}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)^{y}\left( {1 + {\left( \frac{y}{1 + {a_{1}2^{- 1}} + \ldots + {a_{k_{o}}2^{- k_{o}}}} \right)\left( {{a_{k_{o} + 1}2^{- {({k_{o} + 1})}}} + \ldots + {a_{k}2^{- k}}} \right)}} \right)}$ While this appears to look complicated, it's greatly simplified. According to a system embodying the invention, the operation of this equation can be accomplished using two index generation operations, two table lookup operations, three multiplication operations and one add operation. Defining the first term requires finding the position of the most significant bit then a table lookup. The second term is simply a lookup into a k_(o)-bit table. An index is formed directly from the k_(o) coefficients and the (1+a₁2⁻¹+a₂2⁻²+ . . . +a_(k) _(o) 2^(−k) ^(o) )^(y) values are stored in the table. The table has an additional output, y/(1+a₁2⁻¹+ . . . +a_(k) _(o) 2^(−k) ^(o) ), used for the third term. The third term uses the table lookup from the second term, multiplies it with what is essentially an index (specifically, the remaining the bits of the input shifted appropriately so that the multiply makes sense for the given number format) and adds 1 to the result.

In the final operation, the terms are multiplied together, and the output result is generated. The error bound here is also possible to compute. In one method, determining the error bounds requires looking at the Lagrange Remainder Formula for the Taylor series as well as what happens with the first two terms.

Referring to FIG. 1 a, a host signal processor 100 embodying the invention is illustrated. The processor 100 includes a central processing unit 102 that conventionally is used to perform data processing functions for a processor, and further includes an arithmetic unit 104 that is conventionally is used perform the arithmetic operations, such as add, multiply, etc., for the central processing unit. The core mathematical functions unit 106 is configured to perform conventional calculations, and is further configured with a calculation module 108 to perform the operation: x^(y)=v₁*v₂*{1+(v₃*v₄)}, according to the invention. The arithmetic unit is further configured with function module 120 configured to perform x^(y) related functions, and for generating and gathering values used to perform the operation x^(y)=v₁*v₂*{1+(v₃*v₄)}. Each of these will be discussed separately.

The functions module 120 includes a first term generator 122 configured to generate the first term v₁ of the equation. The first term generator includes a MSB locator 124 configured to locate the most significant bit of the number “x”. Those skilled in the art will understand that MSB location operations can be performed using common software processing techniques, where the MSB is determined as the leftmost binary position with a non-zero value, which is true for x as an unsigned or positive integer. The invention is not limited to any particular technique. The first term generator further includes a MSB index generator 126 configured to generate an index value, I_(I), that is used to retrieve a value in a look-up table. The value “v₁” retriever and storage module 128 is configured to retrieve the value of v₁ from a look-up table.

Referring to FIG. 1 b, a memory/storage device 130 is illustrated such a lookup table.

The MSB Table 132 is used to store the values associated with the MSB index value, I₁₁, I₁₂, . . . I_(1n), which correspond to the first index value I₁ discussed above. These MSB index values correspond to the values in the column located to the right of the list of index values that set forth Value-I₁₁, Value-I₁₂, . . . , Value-I_(1n) respectively. The double subscripted values are used to illustrate that the index values are different, and may be sequential. The double subscript notation is intended further to distinguish the first index values from the second index values that correspond with the Second, third and fourth terms discussed below. Referring again to FIG. 1 a, the retriever and storage module 128 is further configured to store the value v₁ for subsequent calculations.

The functions module 120 further includes a second and third term generator 140 configured to generate the terms v₂ and v₃ respectively. The second term generator includes an identifier module 142 configured to identify the k₀ bits, a predetermined and finite number of bits that contribute to define the value of x. More particularly, the k₀ bits define a number of bits that follow the most significant bit of the number x. Once identified, the second term index generator 144 generates a second index value I₂, which is used to index two other values in a look-up table.

More particularly, the Values “v₂” and “v₃” retriever and Storage module 146 is used to look up the values of v₂ and v₃ from Second Values Table 148, shown in FIG. 1 b. Similar to the MSB Table 132, the Second Values Table has a list of index values, I₂₁, I₂₂, . . . I_(2n), which correspond to the second index value I₂ discussed above. In contrast to the MSB Table, however the index values correspond to two values that would be used to generate values for v₂ and v₃. The values generated are Value-I₂₁-a, Value-I₂₂-a, . . . , Value-I_(2n)-a; and also correspond to Value-I₂₁-b, Value-I₂₂-b, . . . , Value-I_(2n)-b respectively. Thus, the index values are used to retrieve the values of v₂ and v₃ as set forth in the Second Values Table.

Referring again to FIG. 1 a, the Arithmetic unit further includes Fourth Term Generator 150, configured with a fixed point number generator module 152 for generating a value of v₄. The fixed point module 152 includes a module 154 configured to identify any remaining fractional values or bits beyond the k₀ bits, if any exist. In a preferred embodiment, this module may be configured to simply deterthine whether any further terms exist that define x, and then retrieve them if they do exist. It may also be configured to retrieve a predetermined number of such secondary values, which may in fact all be zero. A fixed point module 155 is configured to generate a fixed point number representing such values for use in the calculation of x^(y). Once generated, the fixed point number is inserted with an insert mechanism of the remaining values or bits from module 154, which represents the values or fractional bits that may or may not follow the numbers beyond the k₀ bits. The generator 150 finally has a value generator module 158 configured to generate the value v₄.

These values are then used in calculation module 108 to generate a result from the equation x^(y)=v₁*v₂*{1+(v₃*v₄)}

The memory/storage device where the tables are stored may be a separate device that is external to the processor, or may be configured in a monolithic device, where the memory or storage device is located on the same integrated circuit, such as components connected on a single substrate. The invention is not limited to either type of configuration, let alone any other type of physical configuration, but is expansive and includes circuits and systems that perform the novel methods disclosed herein.

The following example illustrates another embodiment on the invention. The steps given below are generic in the sense they are applicable to any x^(y), where x is a fixed-point representation of a floating point number. In the discussion, fractional bits refer to bits to the right of the radix point, while integer bits refer to bits to the left of the radix point.

The following are general steps for computing power functions according to one embodiment of the invention.

1. Find the position, denoted N, of the most significant bit in x. This position serves as the index into a table that contains fixed-point representations of x^((N−fractional) ^(—) ^(bits)y). Denote the retrieved value as v₁ and store it for Step 4.

2. Form another index from the k_(o) bits immediately following the most significant bit. Use this index to address a second table. This second table contains two output values per table entry. One values is (1+a₁2⁻¹+a₂2⁻²+ . . . +a_(k) _(o) 2^(−k) ^(o) )^(y), while the other is y/(1+a₁2⁻¹+ . . . +a_(k) _(o) 2^(−k) ^(o) ). Denote these values as v₂ and v₃ respectively, and store them for Step 4.

3. Create a fixed-point number from remaining bits of x (if any) that directly follow the index from Step 2. Insert these remaining bits into the created number starting at the k_(o)+1 fractional-bit. As such, both the integer-bits and the first k_(o) fractional-bits of the created number are all zero, while the rest of the created number are the remaining bits of x. Denote this value as v₄ and store it for Step 4.

4. Compute the result: x^(y)≈v₁×v₂×[1+(v₃×v₄)] using well-known methods of fixed-point arithmetic.

Referring to FIG. 2, a diagrammatic flow chart is shown to illustrate a method configured according to the invention. In step 200, the process for computing the result: x^(y)βv₁×v₂×[1+(v₃×v₄)] is initiated. In step 202, the most significant bit (MSB) of x is located. Then, an index value I_(I) is generated for use in an MSB table in step 204. In step 206, value of v₁ is retrieved from an MSB table using I_(I). In step 208, the value of v₁ is stored. In step 210, a number of bits, k₀, that follow the MSB of x is identified. In particular, this can be the k₀ bits immediately following the MSB of x. In step 212, a second index value, I₂, is generated for use in a second table. In step 214, values of v₂ and v₃ are retrieved from a second table using I₂. In step 216, the values of v₂ and v₃ are stored. In step 218, a decision is made whether any bits of x remain. If the answer is yes, then the process proceeds to step 220, where any x bits that remain after generating the value of I₂ are identified. In step 222, a fixed point number is generated from the remaining bits. In step 224, the fixed point number, or fixed point number bits, are inserted after the position of k₀. In step 226, a value of v₄ is generated. The result is computed in step 228, where x^(y)≈v₁×v₂×[1+(v₃×v₄)] is calculated with the generated values. Referring back to step 218, if no more x bits remain, then v₄ is set to zero, v₄=0 in step 227, and the result of x^(y)≈v₁×v₂×[1+(v₃×v₄)] is calculated accordingly. The process ends at step 230.

Referring to the diagrammatic view of Table 1, a system is shown illustrating one embodiment of the invention below.

TABLE 1 Example approximate: (2.44140625)^(0.75) = 1.953125

step 4: ν₁ * ν₂ * {1 + (ν₃ * ν₄)}     = 0x1.ae8a * 0x1.28f2 * {0x1.0000 + (0x0.9d8a * 0x0.0080)}     = 0x1.f401     = 1.953140 (result which is close to 1.953125) Table 1. Example

The illustrated example is specific to x^(3/4) where x is a 16-bit number in unsigned 4.12 format (4 bits to the left of the radix point and 12 fractional bits). The 4.12 format of the input implies the table described in Step 1 must have 16 entries. There are additional specific choices made for the example depicted in the example. The index in Step 2 is chosen to be 6 bits, which implies that table has 64 entries. Additionally, v₁, v₂, v₃, and v₄ are all chosen to be in unsigned 4.16 format, which is seen in the tables and the creation of v₄. The computed result in the example correct to 5 digits of precision (all choices discussed impact precision). In a specific example of one embodiment of the invention using real numbers, one implementation of x^(1/4) has a 24-bit input. Two 128 entry tables are used for the second and third terms. The result provides approximately 19 to 20 bits of accuracy using the novel method of two table look-up operations, three multiply operations and one add operation.

Referring to the diagrammatic view of Table 2, a system is shown illustrating another embodiment of the invention below.

TABLE 2 Example approximate: (2.44140625)^(0.75) = 1.953125

step 4: ν₁ * { ν₂ + ( ν′₃ * ν₄)}     = 0x1.ae8a * {0x1.28f2 + 0x0.b6bc * 0x0.0080     = 0x1.f400     = 1.953125 (result which is, in this case, equal to 1.953125) Table 2. Example

In this embodiment the process for computing the result is re-arranged and the lookup tables are adjusted accordingly. The result is computed as x^(y)≈v₁×[v₂+(v′₃×v₄)]. The function of v′₃=v₂×v₃ gives a distributed multiplication of v₂, where the operation is simply a term that is retrieved from a look-up to a table. More specifically, values v₁, v₂, and v₄ are identical to the previous embodiment; however, the table for v₃ has been changed to v₂×v₃, which is pre-computed and stored, and is denoted v′₃. Like the other embodiment discussed above, this novel method reduces storage space and computation resources needed to perform complicated arithmetic operations. This is done by reducing predetermined computations to look-up tables, then retrieving the results to perform a complex mathematic problem in a streamlined manner. The invention provides such a method to process a fixed point approximation in a more efficient manner.

In general, the invention may be utilized in any type of processor, such as dedicated processors, internal and external devices related to digital signal processing, and related devices. The processor may be used to control devices such as webservers configured to receive and route browser requests, application servers, state servers and other types of computer processors configured to communicate amongst each other and that may be connected to one or more networks, including a Local Area Network (LAN), an intranet and the Internet. However, it will be appreciated by those skilled in the art, implementation of such devices and systems are but few illustrations of the utility of the invention, and that the invention may have greater applicability and utility in many other applications where mathematical processing is involved. Equivalent structures embodying the invention could be configured for such applications without diverting from the spirit and scope of the invention. Although this embodiment is described and illustrated in the context of devices and systems for computing mathematical formulae within a digital signal processor, computer system or network, the invention extends to other applications where similar features are useful. The invention may be utilized in personal computers, application servers, state servers or Internet webservers that are designed and implemented on a computer and may be connected to a network for communication with other computers to practice the invention. A system configured to operate according to the invention may include a plurality of personal computers connected to the Internet via individual modems or other communication means such as wireless communications.

The invention may also involve a number of functions to be performed by a computer processor, such as a microprocessor. The microprocessor may be a specialized or dedicated microprocessor that is configured to perform particular tasks by executing machine-readable software code that defines the particular tasks. The microprocessor may also be configured to operate and communicate with other devices such as direct memory access modules, memory storage devices, Internet related hardware, and other devices that relate to the transmission of data in accordance with the invention. The software code may be configured using software formats such as Java, C++, XML (Extensible Mark-up Language) and other languages that may be used to define functions that relate to operations of devices required to carry out the functional operations related to the invention. The code may be written in different forms and styles, many of which are known to those skilled in the art. Different code formats, code configurations, styles and forms of software programs and other means of configuring code to define the operations of a microprocessor in accordance with the invention will not depart from the spirit and scope of the invention.

Within the different types of computers, such as computer servers, that utilize the invention, there exist different types of memory devices for storing and retrieving information while performing functions according to the invention. Cache memory devices are often included in such computers for use by the central processing unit as a convenient storage location for information that is frequently stored and retrieved. Similarly, a persistent memory is also frequently used with such computers for maintaining information that is frequently retrieved by a central processing unit, but that is not often altered within the persistent memory, unlike the cache memory. Main memory is also usually included for storing and retrieving larger amounts of information such as data and software applications configured to perform functions according to the invention when executed by the central processing unit. These memory devices may be configured as random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), flash memory, and other memory storage devices that may be accessed by a central processing unit to store and retrieve information. The invention is not limited to any particular type of memory device, or any commonly used protocol for storing and retrieving information to and from these memory devices respectively.

The apparatus and method include a system and method for computing power functions in the arithmetic unit of a microprocessor. Although this embodiment is described and illustrated in the context of an application for computing x^(y), the scope of the invention extends to other applications where the operation of componentizing of computations and predetermined values used to generated results are useful. Furthermore, while the foregoing description has been with reference to particular embodiments of the invention, it will be appreciated that these are only illustrative of the invention and that changes may be made to those embodiments without departing from the principles of the invention. 

1. A method of generating a fixed point approximation of an inverse function used by an electronic device, comprising: determining a first value, denoted N, representing a position of the most significant bit in x and storing the first value in a computer readable storage; forming an index, denoted M, from the k_(o) bits immediately following the most significant bit, wherein M is used as an index to address a table that contains a plurality of second values, each of the second values representing a sum of one and a binary fraction representation of M, and storing the particular second value within the computer readable storage, the particular second value being denoted v₂, corresponding to the index; creating a fixed-point number from remaining bits of x if any exist that directly follow the index M; inserting the remaining bits into the created number starting at the k_(o)+1 fractional-bit to get an intermediate result, wherein both the integer-bits and the first k_(o) fractional-bits of the created number are all zero, and wherein the remaining bits of the intermediate result are the remaining bits of x to generate a third value, and storing the third value, denoted v₄, within the computer readable storage; computing a final result by a data processor using fixed-point arithmetic to generate said fixed point approximation of said inverse function, wherein computing the final result comprises computing a first result by subtracting a product of the second and third values from one, computing a second result by multiplying the first result by the second value, and computing the final result by multiplying the second result by the first value.
 2. The method according to claim 1, wherein the first value comprises a shift value based upon the most significant bit of x.
 3. The method according to claim 1, wherein multiplying the second result by the first value is performed by shifting the second result based upon the first value.
 4. The method according to claim 1, wherein each table entry contains a value: v ₂=(1+a ₁2⁻¹ +a ₂2⁻² + . . . +a _(k) ₀ 2^(−k) ⁰ )⁻¹.
 5. The method according to claim 1, further comprising computing the final result: x⁻¹≈v₁×v₂×[1−(v₂×v₄)] using fixed-point arithmetic to generate the fixed point approximation of the inverse function used by an electronic device, wherein v₁ denotes the first value, v₂ denotes the second value retrieved from the table and v₄ denotes the third value computed from the remainder of x.
 6. The method according to claim 1, wherein computing the fixed point approximation of the inverse function: x⁻¹ involves one stored table, a single table lookup, and only two multiplications.
 7. A system configured to generate a fixed point approximation of an inverse function used by an electronic device comprising: a processor configured to execute code to determine the most significant bit of a number and to generate a first term, denoted as v₁, based on the value of most significant bit; a lookup table that is configured to store coefficient values within a computer readable storage, wherein the processor is configured to generate a second term, denoted v₂, based on k₀ bits following the most significant bit and 2^k₀ values are stored in the lookup table, wherein the processor is further configured to retrieve the second term, multiply the second term with a third term comprising the remaining bits of the input, denoted v₄, and subtract the result from 1 to generate an intermediate term, and wherein the processor is further configured to multiply the first, second and intermediate terms together to generate a fixed point approximation of the inverse function by the processor.
 8. The system according to claim 7, wherein the first value comprises a shift value based upon the most significant bit of x.
 9. The system according to claim 7, wherein multiplying a product of the second and intermediate terms by the first value is performed by shifting the product based upon the first value.
 10. The system according to claim 7, wherein each table entry contains a value: v ₂=(1+a ₁2⁻¹ +a ₂2⁻² + . . . +a _(k) ₀ 2^(−k) ⁰ )⁻¹.
 11. The system according to claim 7, further comprising computing the final result: x⁻¹≈v₁×v₂×[1−(v₂×v₄)] using fixed-point arithmetic to generate the fixed point approximation of the inverse function, wherein v₁ denotes the first term, v₂ denotes the second term retrieved from the table and v₄ denotes a third term determined by the remaining bits of the input.
 12. The system according to claim 7, wherein generating the fixed point approximation of the inverse function: x⁻¹ involves a single table lookup and only two multiplications.
 13. The system according to claim 7, wherein the fixed point approximation of the inverse function computed by the processor is used by an electronic device.
 14. The system according to claim 7, wherein the fixed point approximation of the inverse function computed by the processor is used by a 3-D graphics device.
 15. The system according to claim 7, wherein the fixed point approximation of the inverse function is used by the processor to generate inversion data for rendering.
 16. A method of generating a fixed point approximation used by an electronic device, comprising: determining a value, denoted N, of the most significant bit in x to serve as an index into a table that contains one or more fixed-point representations of x^((N−fractional) ^(—) ^(bits)y), wherein the retrieved value is denoted as v₁, and storing the value in a computer readable storage; forming another index, denoted M, from the k_(o) bits immediately following the most significant bit, wherein M is used as an index to address a second table that contains two output values per table entry, denoted v₂ and v₃ respectively, and storing the two values in the computer readable storage; creating a fixed-point number from remaining bits of x if any exist that directly follow the index M; inserting these remaining bits into the created number starting at the k_(o)+1 fractional-bit to get a result, wherein both the integer-bits and the first k_(o) fractional-bits of the result are all zero, and wherein the remaining bits of the result are the remaining bits of x to generate a second result v₄, and storing the second result in the computer readable storage; computing the final result: x^(y)≈v₁×v₂×[1+(v₃×v₄)] using fixed-point arithmetic to generate said fixed point approximation by a data processor.
 17. The method according to claim 16, wherein y is −1 and the two output values per table entry are: v ₂=(1+a ₁2⁻¹ +a ₂2⁻² + . . . +a _(k) ₀ 2^(−k) ⁰ )⁻¹; and v ₃=−(1+a ₁2⁻¹ + . . . +a _(k) ₀ 2^(−k) ^(o) )⁻¹, respectively.
 18. The method according to claim 16, wherein the two output values per table entry are: v ₂=(1+a ₁2⁻¹ +a ₂2⁻² + . . . +a _(k) _(o) 2^(−k) ^(o) )^(y); and v ₃ =y/(1+a ₁2⁻¹ + . . . +a _(k) _(o) 2^(−k) ^(o) ), respectively.
 19. An electronic method of generating a fixed point approximation of an inverse of a number x with an electronic data processor, comprising: locating the most significant bit of x; set a shift value v₁ based on a position of the most significant bit of x and storing the shift value; retrieving an output value, v₂, corresponding to a second index value generated from a number of bits, k_(o) bits, immediately following the most significant bit, where the output value is retrieved from a table in a computer readable storage for electronic data storage; generating a third value v₄ corresponding to fractional bits following the k_(o) bits; computing the final result: x⁻¹≈v₁×v₂×[1−(v₂×v₄)] using fixed-point arithmetic logic to generate a fixed point approximation used by the electronic data processor.
 20. The method according to claim 19, further comprising: creating a fixed-point number from remaining bits of x if any exist that directly follow the k_(o) bits; and inserting the fixed point number into the created number starting at the k_(o)+1 fractional-bit to get a result, wherein the remaining bits of the result are the remaining bits of x to generate a second result v₄. 